Convergence Analysis of Iterative Threshold Decoding Process

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Analysis of Iterative Threshold Decoding Process

Today the error correcting codes are present in all the telecom standards, in particular the low density parity check (LDPC) codes. The choice of a good code for a given network is essentially linked to the decoding performance obtained by the bit error rate (BER) curves. This approach requires a significant simulation time proportional to the length of the code, to overcome this problem Exit c...

متن کامل

Convergence analysis for iterative multiuser decoding

We investigate a sub-optimal reduced-complexity iterative technique for joint detection and estimation for sets of constrained sequences and derive analytical results concerning convergence regions and fixed points. We apply this theory to the problem of multiple-user decoding.

متن کامل

Convergence behavior of iterative source-channel decoding

Whenever digital communication is subject to transmission errors, the utilization of reliability information at the receiver is henefi-cial. Soft-channel decoding techniques improve the ermr correcr-ing capabilities and in addition, sofrbir source decoding performs error concealmenr. While the reliability gain of channel decoding is based on artificial diversities explicitly introduced at the t...

متن کامل

Convergence of non-binary iterative decoding

Mutual information transfer characteristics have been recently proposed by ten Brink as a quasi-analytical tool for the performance analysis of iterative decoding of concatenated codes. Given the individual transfer characteristics of the component codes in a concatenated coding system (obtained by simulation), the convergence region and average decoding trajectory of the concatenated system ma...

متن کامل

Iterative Threshold Decoding Of High Rates Quasi-Cyclic OSMLD Codes

Majority logic decoding (MLD) codes are very powerful thanks to the simplicity of the decoder. Nevertheless, to find constructive families of these codes has been recognized to be a hard job. Also, the majority of known MLD codes are cyclic which are limited in the range of the rates. In this paper a new adaptation of the Iterative threshold decoding algorithm is considered, for decoding Quasi-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and Communications

سال: 2016

ISSN: 2327-5219,2327-5227

DOI: 10.4236/jcc.2016.414008